0.03/0.12	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.03/0.12	% Command    : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 240 THM
0.11/0.33	% Computer : n002.cluster.edu
0.11/0.33	% Model    : x86_64 x86_64
0.11/0.33	% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.11/0.33	% Memory   : 8042.1875MB
0.11/0.33	% OS       : Linux 3.10.0-693.el7.x86_64
0.11/0.33	% CPULimit   : 1920
0.11/0.33	% WCLimit    : 240
0.11/0.33	% DateTime   : Wed Jul 30 02:48:49 EDT 2025
0.11/0.33	% CPUTime    : 
0.19/0.47	Running higher-order theorem proving
0.19/0.48	Running: /export/starexec/sandbox/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=240 /export/starexec/sandbox/tmp/tmp.IGrWZW4Kju/E---3.1_16023.p
0.19/0.49	# Version: 3.0.0-ho
0.19/0.49	# Preprocessing class: HSSSSMSSMLSNHHN.
0.19/0.49	# Scheduled 4 strats onto 8 cores with 240 seconds (1920 total)
0.19/0.49	# Starting new_ho_10 with 1200s (5) cores
0.19/0.49	# Starting pre_casc_5 with 240s (1) cores
0.19/0.49	# Starting post_as_ho11 with 240s (1) cores
0.19/0.49	# Starting ho_unfolding_1 with 240s (1) cores
0.19/0.49	# pre_casc_5 with pid 16151 completed with status 0
0.19/0.49	# Result found by pre_casc_5
0.19/0.49	# Preprocessing class: HSSSSMSSMLSNHHN.
0.19/0.49	# Scheduled 4 strats onto 8 cores with 240 seconds (1920 total)
0.19/0.49	# Starting new_ho_10 with 1200s (5) cores
0.19/0.49	# Starting pre_casc_5 with 240s (1) cores
0.19/0.49	# SinE strategy is GSinE(CountFormulas,hypos,3,,5,20000,1.0,true)
0.19/0.49	# Search class: HGUSF-FFSF00-SHHSMFNN
0.19/0.49	# partial match(2): HGUNF-FFSF00-SHSSMFNN
0.19/0.49	# Scheduled 6 strats onto 1 cores with 240 seconds (240 total)
0.19/0.49	# Starting new_ho_10 with 130s (1) cores
0.19/0.49	# new_ho_10 with pid 16156 completed with status 0
0.19/0.49	# Result found by new_ho_10
0.19/0.49	# Preprocessing class: HSSSSMSSMLSNHHN.
0.19/0.49	# Scheduled 4 strats onto 8 cores with 240 seconds (1920 total)
0.19/0.49	# Starting new_ho_10 with 1200s (5) cores
0.19/0.49	# Starting pre_casc_5 with 240s (1) cores
0.19/0.49	# SinE strategy is GSinE(CountFormulas,hypos,3,,5,20000,1.0,true)
0.19/0.49	# Search class: HGUSF-FFSF00-SHHSMFNN
0.19/0.49	# partial match(2): HGUNF-FFSF00-SHSSMFNN
0.19/0.49	# Scheduled 6 strats onto 1 cores with 240 seconds (240 total)
0.19/0.49	# Starting new_ho_10 with 130s (1) cores
0.19/0.49	# Preprocessing time       : 0.001 s
0.19/0.49	# Presaturation interreduction done
0.19/0.49	
0.19/0.49	# Proof found!
0.19/0.49	# SZS status Theorem
0.19/0.49	# SZS output start CNFRefutation
0.19/0.49	thf(decl_23, type, subrel: ($i > $i > $o) > ($i > $i > $o) > $o).
0.19/0.49	thf(decl_27, type, mono: (($i > $i > $o) > $i > $i > $o) > $o).
0.19/0.49	thf(decl_30, type, rc: ($i > $i > $o) > $i > $i > $o).
0.19/0.49	thf(decl_52, type, epred1_0: $i > $i > $o).
0.19/0.49	thf(decl_53, type, epred2_0: $i > $i > $o).
0.19/0.49	thf(decl_54, type, esk1_0: $i).
0.19/0.49	thf(decl_55, type, esk2_0: $i).
0.19/0.49	thf(monotonic, axiom, ((mono)=(^[X5:($i > $i > $o) > $i > $i > $o]:(![X1:$i > $i > $o, X2:$i > $i > $o]:(((subrel @ X1 @ X2)=>(subrel @ (X5 @ X1) @ (X5 @ X2))))))), file('/export/starexec/sandbox/tmp/tmp.IGrWZW4Kju/E---3.1_16023.p', monotonic)).
0.19/0.49	thf(subrel, axiom, ((subrel)=(^[X1:$i > $i > $o, X2:$i > $i > $o]:(![X3:$i, X4:$i]:(((X1 @ X3 @ X4)=>(X2 @ X3 @ X4)))))), file('/export/starexec/sandbox/tmp/tmp.IGrWZW4Kju/E---3.1_16023.p', subrel)).
0.19/0.49	thf(reflexive_closure, axiom, ((rc)=(^[X1:$i > $i > $o, X3:$i, X4:$i]:((((X3)=(X4))|(X1 @ X3 @ X4))))), file('/export/starexec/sandbox/tmp/tmp.IGrWZW4Kju/E---3.1_16023.p', reflexive_closure)).
0.19/0.49	thf(reflexive_closure_op_is_monotonic, conjecture, (mono @ rc), file('/export/starexec/sandbox/tmp/tmp.IGrWZW4Kju/E---3.1_16023.p', reflexive_closure_op_is_monotonic)).
0.19/0.49	thf(c_0_4, plain, ((mono)=(^[Z0/* 6 */:($i > $i > $o) > $i > $i > $o]:(![X1:$i > $i > $o, X2:$i > $i > $o]:(((![X9:$i, X10:$i]:(((X1 @ X9 @ X10)=>(X2 @ X9 @ X10))))=>(![X11:$i, X12:$i]:(((Z0 @ X1 @ X11 @ X12)=>(Z0 @ X2 @ X11 @ X12))))))))), inference(fof_simplification,[status(thm)],[monotonic])).
0.19/0.49	thf(c_0_5, plain, ((subrel)=(^[Z0/* 19 */:$i > $i > $o, Z1:$i > $i > $o]:(![X3:$i, X4:$i]:(((Z0 @ X3 @ X4)=>(Z1 @ X3 @ X4)))))), inference(fof_simplification,[status(thm)],[subrel])).
0.19/0.49	thf(c_0_6, plain, ((mono)=(^[Z0/* 6 */:($i > $i > $o) > $i > $i > $o]:(![X1:$i > $i > $o, X2:$i > $i > $o]:(((![X9:$i, X10:$i]:(((X1 @ X9 @ X10)=>(X2 @ X9 @ X10))))=>(![X11:$i, X12:$i]:(((Z0 @ X1 @ X11 @ X12)=>(Z0 @ X2 @ X11 @ X12))))))))), inference(apply_def,[status(thm)],[c_0_4, c_0_5])).
0.19/0.49	thf(c_0_7, plain, ((rc)=(^[Z0/* 19 */:$i > $i > $o, Z1:$i, Z2:$i]:((((Z1)=(Z2))|(Z0 @ Z1 @ Z2))))), inference(fof_simplification,[status(thm)],[reflexive_closure])).
0.19/0.49	thf(c_0_8, negated_conjecture, ~(![X81:$i > $i > $o, X82:$i > $i > $o]:((![X83:$i, X84:$i]:(((X81 @ X83 @ X84)=>(X82 @ X83 @ X84)))=>![X85:$i, X86:$i]:(((((X85)=(X86))|(X81 @ X85 @ X86))=>(((X85)=(X86))|(X82 @ X85 @ X86))))))), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(assume_negation,[status(cth)],[reflexive_closure_op_is_monotonic]), c_0_6]), c_0_7])).
0.19/0.49	thf(c_0_9, negated_conjecture, ![X89:$i, X90:$i]:(((~(epred1_0 @ X89 @ X90)|(epred2_0 @ X89 @ X90))&((((esk1_0)=(esk2_0))|(epred1_0 @ esk1_0 @ esk2_0))&(((esk1_0)!=(esk2_0))&~(epred2_0 @ esk1_0 @ esk2_0))))), inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_8])])])])])).
0.19/0.49	thf(c_0_10, negated_conjecture, (((esk1_0)=(esk2_0))|(epred1_0 @ esk1_0 @ esk2_0)), inference(split_conjunct,[status(thm)],[c_0_9])).
0.19/0.49	thf(c_0_11, negated_conjecture, ((esk1_0)!=(esk2_0)), inference(split_conjunct,[status(thm)],[c_0_9])).
0.19/0.49	thf(c_0_12, negated_conjecture, ~((epred2_0 @ esk1_0 @ esk2_0)), inference(split_conjunct,[status(thm)],[c_0_9])).
0.19/0.49	thf(c_0_13, negated_conjecture, ![X3:$i, X4:$i]:(((epred2_0 @ X3 @ X4)|~((epred1_0 @ X3 @ X4)))), inference(split_conjunct,[status(thm)],[c_0_9])).
0.19/0.49	thf(c_0_14, negated_conjecture, (epred1_0 @ esk1_0 @ esk2_0), inference(sr,[status(thm)],[c_0_10, c_0_11])).
0.19/0.49	thf(c_0_15, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12, c_0_13]), c_0_14])]), ['proof']).
0.19/0.49	# SZS output end CNFRefutation
0.19/0.49	# Parsed axioms                        : 59
0.19/0.49	# Removed by relevancy pruning/SinE    : 45
0.19/0.49	# Initial clauses                      : 4
0.19/0.49	# Removed in clause preprocessing      : 0
0.19/0.49	# Initial clauses in saturation        : 4
0.19/0.49	# Processed clauses                    : 8
0.19/0.49	# ...of these trivial                  : 0
0.19/0.49	# ...subsumed                          : 0
0.19/0.49	# ...remaining for further processing  : 8
0.19/0.49	# Other redundant clauses eliminated   : 0
0.19/0.49	# Clauses deleted for lack of memory   : 0
0.19/0.49	# Backward-subsumed                    : 0
0.19/0.49	# Backward-rewritten                   : 0
0.19/0.49	# Generated clauses                    : 1
0.19/0.49	# ...of the previous two non-redundant : 0
0.19/0.49	# ...aggressively subsumed             : 0
0.19/0.49	# Contextual simplify-reflections      : 0
0.19/0.49	# Paramodulations                      : 1
0.19/0.49	# Factorizations                       : 0
0.19/0.49	# NegExts                              : 0
0.19/0.49	# Equation resolutions                 : 0
0.19/0.49	# Disequality decompositions           : 0
0.19/0.49	# Total rewrite steps                  : 1
0.19/0.49	# ...of those cached                   : 0
0.19/0.49	# Propositional unsat checks           : 0
0.19/0.49	#    Propositional check models        : 0
0.19/0.49	#    Propositional check unsatisfiable : 0
0.19/0.49	#    Propositional clauses             : 0
0.19/0.49	#    Propositional clauses after purity: 0
0.19/0.49	#    Propositional unsat core size     : 0
0.19/0.49	#    Propositional preprocessing time  : 0.000
0.19/0.49	#    Propositional encoding time       : 0.000
0.19/0.49	#    Propositional solver time         : 0.000
0.19/0.49	#    Success case prop preproc time    : 0.000
0.19/0.49	#    Success case prop encoding time   : 0.000
0.19/0.49	#    Success case prop solver time     : 0.000
0.19/0.49	# Current number of processed clauses  : 4
0.19/0.49	#    Positive orientable unit clauses  : 1
0.19/0.49	#    Positive unorientable unit clauses: 0
0.19/0.49	#    Negative unit clauses             : 2
0.19/0.49	#    Non-unit-clauses                  : 1
0.19/0.49	# Current number of unprocessed clauses: 0
0.19/0.49	# ...number of literals in the above   : 0
0.19/0.49	# Current number of archived formulas  : 0
0.19/0.49	# Current number of archived clauses   : 4
0.19/0.49	# Clause-clause subsumption calls (NU) : 0
0.19/0.49	# Rec. Clause-clause subsumption calls : 0
0.19/0.49	# Non-unit clause-clause subsumptions  : 0
0.19/0.49	# Unit Clause-clause subsumption calls : 0
0.19/0.49	# Rewrite failures with RHS unbound    : 0
0.19/0.49	# BW rewrite match attempts            : 0
0.19/0.49	# BW rewrite match successes           : 0
0.19/0.49	# Condensation attempts                : 8
0.19/0.49	# Condensation successes               : 0
0.19/0.49	# Termbank termtop insertions          : 1664
0.19/0.49	# Search garbage collected termcells   : 575
0.19/0.49	
0.19/0.49	# -------------------------------------------------
0.19/0.49	# User time                : 0.002 s
0.19/0.49	# System time              : 0.004 s
0.19/0.49	# Total time               : 0.006 s
0.19/0.49	# Maximum resident set size: 2136 pages
0.19/0.49	
0.19/0.49	# -------------------------------------------------
0.19/0.49	# User time                : 0.004 s
0.19/0.49	# System time              : 0.005 s
0.19/0.49	# Total time               : 0.009 s
0.19/0.49	# Maximum resident set size: 1784 pages
0.19/0.49	% E exiting
0.19/0.49	% E exiting
0.19/0.49	EOF